A Tight Bound for the Joint Covariance of Two Random Vectors with Unknown but Constrained Cross--Correlation

نویسندگان

  • Uwe D. Hanebeck
  • Kai Briechle
  • Joachim Horn
چکیده

This paper derives a fundamental result for processing two correlated random vectors with unknown cross–correlation, where constraints on the maximum absolute correlation coefficient are given. A tight upper bound for the joint covariance matrix is derived on the basis of the individual covariances and the correlation constraint. For symmetric constraints, the bounding covariance matrix naturally possesses zero cross covariances, which further increases their usefulness in applications. Performance is demonstrated by recursively propagating a state through a linear dynamical system suffering from stochastic noise correlated with the system state.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An `∞ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation

In statistics and machine learning, people are often interested in the eigenvectors (or singular vectors) of certain matrices (e.g. covariance matrices, data matrices, etc). However, those matrices are usually perturbed by noises or statistical errors, either from random sampling or structural patterns. One usually employs Davis-Kahan sin θ theorem to bound the difference between the eigenvecto...

متن کامل

Frame Moments and Welch Bound with Erasures

The Welch Bound is a lower bound on the root mean square cross correlation between n unit-norm vectors f1, ..., fn in the m dimensional space (Rm or Cm), for n ≥ m. Letting F = [f1|...|fn] denote the m-by-n frame matrix, the Welch bound can be viewed as a lower bound on the second moment of F , namely on the trace of the squared Gram matrix (F ′F ). We consider an erasure setting, in which a re...

متن کامل

LP problems constrained with D-FRIs

In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Dombi family of t-norms is considered as fuzzy composition. Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of ...

متن کامل

Brownian distance covariance

Distance correlation is a new class of multivariate dependence coefficients applicable to random vectors of arbitrary and not necessarily equal dimension. Distance covariance and distance correlation are analogous to product-moment covariance and correlation, but generalize and extend these classical bivariate measures of dependence. Distance correlation characterizes independence: it is zero i...

متن کامل

Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs

In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative ver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001